#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

int n;
vector<string> res;
set<string> st;

void dfs(int l, int r, string s) {
    if (res.size() == n) return;
    if (l < r || l > n || r > n) return;
    if (l == r && l == n) {
        if(st.count(s)) return;
        st.insert(s);
        res.push_back(s);
        return ;
    }
    dfs(l + 1, r, s + "(");
    dfs(l, r + 1, s + ")");

}

inline void solution() {
    cin >> n;
    res.clear();
    st.clear();
    dfs(0, 0, "");
    for (int i = 0; i < n; i ++ )
        cout << res[i] << endl;
}

int main() {
    // freopen("input.txt", "r", stdin);
    quickread();
    int T;
    cin >> T;
    while (T -- ) {
       solution();
    }
    return 0;
}